Combining Independent Modules to Solve Multiple-choice Synonym and Analogy Problems

نویسندگان

  • Peter D. Turney
  • Michael L. Littman
  • Jeffrey Bigham
  • Victor Shnayder
چکیده

Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be best for all problem instances. Many researchers are examining ensemble methods that combine the output of successful, separately developed modules to create more accurate solutions. This paper examines three merging rules for combining probability distributions: the well known mixture rule, the logarithmic rule, and a novel product rule. These rules were applied with state-of-theart results to two problems commonly used to assess human mastery of lexical semantics— synonym questions and analogy questions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining independent modules in lexical multiple-choice problems

Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be best for all problem instances. Many researchers are examining ensemble methods that combine the output of multiple modules to create more accurate solutions. This paper examines three merging rules for combining probabil...

متن کامل

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations

Recognizing analogies, synonyms, antonyms, and associations appear to be four distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks have been treated independently, using a wide variety of algorithms. These four semantic classes, however, are a tiny sample of the full range of semantic phenomena, and we cannot afford to create ad hoc algorithms for each semantic phenome...

متن کامل

A NEW MULTIPLE CRITERIA DECISION-MAKING METHOD BASED ON BIPOLAR FUZZY SOFT GRAPHS

In this research study, we present a novel frame work for handling bipolar fuzzy soft information by combining bipolar fuzzy soft sets with graphs. We introduce several basic notions concerning bipolar fuzzy soft graphs and investigate some related properties. We also consider the application of the bipolar fuzzy soft graphs. In particular, three efficient algorithms are developed to solve mult...

متن کامل

A New Approach to Solve Multiple Objective Programming Problems

Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.CL/0309035  شماره 

صفحات  -

تاریخ انتشار 2003